Erratum: Block Kronecker Products and Block Norm Matrices in Large-Scale Systems Analysis
نویسندگان
چکیده
منابع مشابه
Spectra of large block matrices
In a frequency selective slow-fading channel in a MIMO system, the channel matrix is of the form of a block matrix. This paper proposes a method to calculate the limit of the eigenvalue distribution of block matrices if the size of the blocks tends to infinity. While it considers random matrices, it takes an operator-valued free probability approach to achieve this goal. Using this method, one ...
متن کاملKronecker product approximations for dense block Toeplitz-plus-Hankel matrices
In this paper, we consider the approximation of dense block Toeplitz-plus-Hankel matrices by sums of Kronecker products. We present an algorithm for efficiently computing the matrix approximation that requires the factorization of matrices of much smaller dimension than that of the original. The main results are described for block Toeplitz matrices with Toeplitz-plus-Hankel blocks (BTTHB), but...
متن کاملBlock Kronecker Product Graph Model
Since Kronecker Product Graph Model (KPGM) was introduced, it has been widely used to model real networks. The characteristics of the model specially its single fractal structure have made KPGM one of the most important algorithm of the last years. However, the utilization of a single fractal structure decreases the potential of KPGM by limiting the graph space covered by the model. In this pap...
متن کاملA Norm Compression Inequality for Block Partitioned Positive Semidefinite Matrices
where B and D are square blocks. We prove the following inequalities for the Schatten q-norm ||.||q , which are sharp when the blocks are of size at least 2× 2: ||A||q ≤ (2 q − 2)||C||q + ||B|| q q + ||D|| q q, 1 ≤ q ≤ 2, and ||A||q ≥ (2 q − 2)||C||q + ||B|| q q + ||D|| q q, 2 ≤ q. These bounds can be extended to symmetric partitionings into larger numbers of blocks, at the expense of no longer...
متن کاملBlock CUR : Decomposing Large Distributed Matrices
A common problem in large-scale data analysis is to approximate a matrix using a combination of specifically sampled rows and columns, known as CUR decomposition. Unfortunately, in many real-world environments, the ability to sample specific individual rows or columns of the matrix is limited by either system constraints or cost. In this paper, we consider matrix approximation by sampling prede...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 1989
ISSN: 0895-4798,1095-7162
DOI: 10.1137/0610042